منابع مشابه
JErlang: Erlang with Joins
Erlang is an industrially successful functional language that uses the Actor model for concurrency. It supports the message-passing paradigm by providing pattern-matching over received messages. Unfortunately coding synchronisation between multiple processes is not straightforward. To overcome this limitation we designed and implemented JErlang, a Join-Calculus inspired extension to Erlang. We ...
متن کاملFaster Joins , Self - Joins and
We propose a new algorithm, called Stripe-join, for performing a join given a join index. Stripe-join is inspired by an algorithm called \Jive-join" developed by Li and Ross. Stripe-join makes a single sequential pass through each input relation, in addition to one pass through the join index and two passes through a set of temporary les that contain tuple identiiers but no input tuples. Stripe...
متن کاملEfficient MRC Construction with SHARDS
Reuse-distance analysis is a powerful technique for characterizing temporal locality of workloads, often visualized with miss ratio curves (MRCs). Unfortunately, even the most efficient exact implementations are too heavyweight for practical online use in production systems. We introduce a new approximation algorithm that employs uniform randomized spatial sampling, implemented by tracking refe...
متن کاملApproximate String Joins with Abbreviations
String joins have wide applications in data integration and cleaning. The inconsistency of data caused by data errors, term variations and missing values has led to the need for approximate string joins (ASJ). In this paper, we study ASJ with abbreviations, which are a frequent type of term variation. Although prior works have studied ASJ given a userinputted dictionary of synonym rules, they h...
متن کاملConvergent Inference with Leaky Joins
Over the past decade, a class of model database engines like BayesStore, MauveDB, and numerous others have emerged, allowing users to interact with probabilistic graphical models through queries. A key task for model databases, computing marginal probabilities grows exponentially in the complexity of the graph. Although exact solutions are feasible for smaller graphs, for larger graphs approxim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1988
ISSN: 0028-0836,1476-4687
DOI: 10.1038/334003b0